Flow Fair Sampling Based on Multistage Bloom Filters
نویسندگان
چکیده
منابع مشابه
On Bloom filters
Bloom filters are heavily used in the literature for efficiently representing sets with elements from a large universe. However, the current literature lacks some important functionality on bloom filters which can be proven useful in several application domains, especially in distributed and P2P systems. This work presents some of these extensions. The work is motivated from our current researc...
متن کاملBloom filters
Bloom filters are used for answering queries on set membership. In this data structure, the whole element is not stored at the hashed address. Only a few bits are set in an array. Given a set S of cardinality n, we store it in an array of m bits using k hash functions h1(), . . . , hk(). Initially, all the cells in the array are set to 0. Then, for each element in the set, x ∈ S, for each 1 ≤ i...
متن کاملBloom-Based Filters for Hierarchical Data
In this paper, we present two novel hash-based indexing structures, based on Bloom filters, called Breadth and Depth Bloom filters, which in contrast to traditional hash-based indexes, are able to summarize hierarchical data and support regular path expression queries. We describe how these structures can be used for resource discovery in peer-to-peer networks. We have implemented both structur...
متن کاملBloom-Based Filters for Hierarchical Data1
In this paper, we present two novel hash-based indexing structures, based on Bloom filters, called breadth and depth Bloom filters, which in contrast to traditional hash based indexes, are able to represent hierarchical data and support path expression queries. We describe how these structures can be used for resource discovery in peer-to-peer networks. We have implemented both structures and o...
متن کاملComparing Binary Iris Biometric Templates Based on Counting Bloom Filters
In this paper a binary biometric comparator based on Counting Bloom filters is introduced. Within the proposed scheme binary biometric feature vectors are analyzed and appropriate bit sequences are mapped to Counting Bloom filters. The comparison of resulting sets of Counting Bloom filters significantly improves the biometric performance of the underlying system. The proposed approach is applie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TELKOMNIKA (Telecommunication Computing Electronics and Control)
سال: 2016
ISSN: 2302-9293,1693-6930
DOI: 10.12928/telkomnika.v14i3.3648